Fragmentation with a Steady Source

نویسندگان

  • E. Ben-Naim
  • P. L. Krapivsky
چکیده

Fragmentation underlies numerous natural phenomena [1–5]. The quantity being “split” can be the mass, momentum, or the area, and typically, fragments continue splitting independently of each other. Examples include polymer degradation [6], breakup of liquid droplets [7] and atomic nuclei [8], martensitic transformations [9,10], shattering of solid objects [11,12], and meteor impacts. Fragmentation also arises in several topics of computer science [13–15]. The simplest fragmentation models assume that the rate by which fragments are produced is a function of their size only [16–20]. In this study, we focus on the classic “random scission model” where the cutting is uniform and hence a fragment is cut with a rate proportional to its size. In particular, we are interested in situations where the system is subject to a steady input of fragments. Such “open” systems occur in industrial applications where coarse material is continuously fed into a grinding apparatus to produce a fine powder [21–23]. Fragmentation in open systems has received less attention than fragmentation in closed systems [24,25]. We will show, however, that fragmentation with input is actually simpler than the classical counterpart as the system reaches a stationary state which is remarkably robust. Specifically, fragmentation with a steady source is characterized by an algebraic divergence of the size distribution in the small size limit, and this behavior is independent of the particular form of the input. Additionally, the time dependent behavior, obtained analytically for arbitrary inputs, follows a scaling behavior. These two features are shown to be closely related. We start with a one-dimensional fragmentation process subject to constant input of segments. Here “onedimensional” means that the fragments are characterized by a single variable which we shall call “length” (the fragments can be viewed as segments). Let the system be initially empty and intervals whose length is within the range (x, x+ dx) are added with rate f(x) dx. Additionally, intervals are cut with a constant spatially homogeneous rate; we set this rate equal to unity without loss of generality. Fragmentation with input has a natural geometric interpretation. Consider the segments as part of an infinite line. The fragmentation process is equivalent to deposition of point “cracks” on the line. The line is initially “immune” to fragmentation, but then segments of length x become “susceptible” to fragmentation with rate f(x). Hence, fragmentation with input is equivalent to inhomogeneous fragmentation of a growing line. The density P (x, t) of intervals of length x at time t evolves according to the following rate equation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Investigation on Contaminant Dispersion from a Source over the Blocks in Steady and Unsteady Flows

This paper deals with numerical study of semi-finite incompressible flow of air over two blocks with different heights in the presence of a condensing-source, dispensing- contaminant in the flow, in both steady and unsteady states. The numerical solution of governing PDE equations are constructed by a finite-volume method applied on structured grid arrangement. The effects of air flow velocity,...

متن کامل

What Determines Size Distributions of Heavy Drops in a Synthetic Turbulent Flow?

We present results from an individual particle based model for the collision, coagulation and fragmentation of heavy drops moving in a turbulent flow. Such a model framework can help to bridge the gap between the full hydrodynamic simulation of two phase flows, which can usually only study few particles and mean field based approaches for coagulation and fragmentation which rely heavily on para...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Particle-based modelling of aggregation and fragmentation processes in chaotic advection: Fractal aggregates

The incorporation of particle inertia into the usual mean field theory for particle aggregation and fragmentation in fluid flows is still an unsolved problem. We therefore suggest an alternative approach that is based on the dynamics of individual inertial particles and apply this to study steady state particle size distributions in a paradigmatic 2d flow. We show how a fractal structure, typic...

متن کامل

Investigating fragmentation conditions in self - gravitating accretion discs

The issue of fragmentation in self-gravitating gaseous accretion discs has implications both for the formation of stars in discs in the nuclei of active galaxies, and for the formation of gaseous planets or brown dwarfs in circumstellar discs. It is now well established that fragmentation occurs if the disc is cooled on a timescale smaller than the local dynamical timescale, while for longer co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000